class Solution {
    public int search(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while (left <= right) {
            int mid = (left + right) >> 1;
            if (nums[mid] > target) {
                right = mid - 1;
            } else if (nums[mid] < target) {
                left = mid + 1;
            } else {
                int res = 0, m = mid + 1;
                while (m < nums.length && nums[m++] == target) {
                    res++;
                }
                while (mid >= 0 && nums[mid--] == target) {
                    res++;
                }
                return res;
            }
        }
        return 0;
    }
}